Drawing planar graphs with circular arcs
نویسندگان
چکیده
منابع مشابه
Drawing Planar Graphs with Circular Arcs
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the area of drawings in which edges are drawn using exactly one circular arc. We also give an algorithm for drawing n-vertex planar graphs such that the edges are sequences of two continuous circular arcs. The algorithm ru...
متن کاملUniversal Point Sets for Drawing Planar Graphs with Circular Arcs
We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a planar drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc. Submitted: October 2013 Reviewed: February 2014 Revised: March 2014 Accepted: April 2014 Final: May 2014 Published: May 2014 Article type: Regular paper Communicat...
متن کاملDrawing Graphs with Few Arcs
Let G = (V,E) be a planar graph. An arrangement of circular arcs is called a composite arc-drawing of G, if its 1-skeleton is isomorphic to G. Similarly, a composite segment-drawing is described by an arrangement of straight-line segments. We ask for the smallest possible ground set of arcs/segments for a composite arc/segment-drawing. We present algorithms for constructing composite arc-drawin...
متن کاملFixed-Location Circular Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in the plane. If for every edge we have only two possible circular arcs, then a simple reduction to 2SAT yields an O(n) algorithm to find out if a drawing with no crossings can be realized, where n is the number of vertice...
متن کاملContact Graphs of Circular Arcs
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interiordisjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most 2s− k edges, and (2, k)-tight if in addition it has exactly 2n− k edges, where n is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2001
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s004540010080